Evolutionary Multiobjective Bayesian Optimization Algorithm: Experimental Study
نویسندگان
چکیده
This paper deals with the utilizing of the Bayesian optimization algorithm (BOA) for multiobjective optimization of hypergraph partitioning. The main attention is focused on the incorporation of the Pareto optimality concept. We have modified the standard algorithm BOA for one criterion optimization according to well known niching techniques to find the Pareto optimal set. This approach was compared with standard weighting techniques and the single optimization approach with the constraint. The experiments are focused mainly on the bi-objective optimization because of the visualization simplicity.
منابع مشابه
Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملEvolutionary Bayesian Belief Networks for Participatory Water Resources Management under Uncertainty
A participatory integrated (social, economic, environmental) approach based on causal loop diagram, Bayesian belief networks and evolutionary multiobjective optimisation is proposed for efficient water resources management. The proposed methodology incorporates all the conflicting objectives in the decision making process. Causal loop diagram allows a range of different factors to be considered...
متن کاملMultiobjective Hboa, Clustering, and Scalability Multiobjective Hboa, Clustering, and Scalability
This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominated sorting genetic algorithm (NSGA-II) and clustering in the objective space. It is first argued that for good scalability, clustering or some other form of niching in the objective space is necessary and the size of e...
متن کاملPareto-based Cost Simulated Annealing for Multiobjective Optimization
In this paper, a multiobjective simulated annealing (MOSA) method is introduced and discussed with the multiobjective evolutionary algorithms (MOEAs). Though the simulated annealing is a very powerful search algorithm and has shown good results in various singleobjective optimization fields, it has been seldom used for the multiobjective optimization because it conventionally uses only one sear...
متن کاملPSFGA: A Parallel Genetic Algorithm for Multiobjective Optimization
This paper presents the Parallel Single Front Genetic Algorithm (PSFGA), a parallel Pareto-based algorithm for multiobjective optimization problems based on an evolutionary procedure. In this procedure, a population of solutions is sorted with respect to the values of the objective functions and partitioned into subpopulations which are distributed among the processors. Each processor applies a...
متن کامل